Temperature aware online algorithms for scheduling equal length jobs
نویسندگان
چکیده
منابع مشابه
Online Scheduling of Equal-Length Jobs on Parallel Machines
We study on-line scheduling of equal-length jobs on parallel machines. Our main result is an algorithm with competitive ratio decreasing to e/(e − 1) ≈ 1.58 as the number of machine increases. For m ≥ 3, this is the first algorithm better than 2-competitive greedy algo-
متن کاملImproved Online Scheduling in Maximizing Throughput of Equal Length Jobs
Inspired by Mechanism Design, we study an online scheduling problem in maximizing throughput of equal length jobs with application in Auctions. We design monotone algorithms with improved competitive ratio for the problem in both models of restart and resume. Due to the monotonicity property, our algorithms deduce truthful mechanisms with the same competitive ratio in maximizing the total welfa...
متن کاملOnline Scheduling of Equal-Length Jobs: Randomization and Restarts Help
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to determine a single-processor, non-preemptive schedule that maximizes the number of completed jobs. In the online version, each job arrives at its release time. We give two online algorithms with competitive ratios belo...
متن کاملOnline Algorithms for Scheduling Unit Jobs
In this abstract we give a short survey of results from [5, 3] on the following unit-job scheduling problem. We are given a set of unit-length jobs, with each job specified by a triple ( ) where and are integral release times and deadlines, and is a non-negative real weight. We have a single machine, i.e., one job can be processed at each integer time. We use the term weighted throughput or gai...
متن کاملOnline algorithms for temperature aware job scheduling problems
Temperature is an important consideration when designing microprocessors. When exposed to high temperatures component reliability can be reduced, while some components completely fail over certain temperatures. We consider the design and analysis of online algorithms; in particular algorithms that use knowledge of the amount of heat a job will generate. We consider algorithms with two main obje...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.02.003